Constructive Algebra for Systems Theory (CAST)
ثبت نشده
چکیده
Algebraic methods have been successfully applied to problems arising in systems theory for a very long time now (see, e.g., [31, 65, 35, 30]). The most important reasons are the following. Algebra provides structural information about the systems under consideration, which could not be obtained by using numerical methods alone. An algebraic approach to linear control systems leads to a classification of structural properties of the system which can be characterized in algebraic terms and checked by symbolic computation, e.g. the fundamental notions of controllability, observability, and flatness. Using this algebraic language, multidimensional linear systems, also called n-dimensional systems, defined by partial differential equations, differential time-delay systems, discrete systems, repetitive systems, hybrid systems etc. can be treated simultaneously; depending on the type of the linear system under consideration one deals with modules defined over a (possibly non-commutative) polynomial ring which contains all functional operators that are present in the governing equations (e.g., differential/time-delay/shift operators). Therefore algebra provides a unified approach to system theoretic phenomena which are common to many types of multidimensional linear systems.
منابع مشابه
Une introduction à l’analyse algébrique constructive et à ses applications
This text is an extension of lectures notes I prepared for les Journées Nationales de Calcul Formel held at the CIRM, Luminy (France) on May 3-7, 2010. The main purpose of these lectures was to introduce the French community of symbolic computation to the constructive approach to algebraic analysis and particularly to algebraic D-modules, its applications to mathematical systems theory and its ...
متن کاملConstructive Algebra in Functional Programming and Type Theory
This thesis considers abstract algebra from a constructive point of view. The central concept of study is coherent rings − algebraic structures in which it is possible to solve homogeneous systems of linear equations. Three different algebraic theories are considered; Bézout domains, Prüfer domains and polynomial rings. The first two of these are non-Noetherian analogues of classical notions. T...
متن کاملA matrix method for finding the minimum or infimum of a polynmial
A method is described for finding the global minimum or infimum of a polynomial in several variables. Both the value of the minimum or infimum is obtained as well as at least one point where the minimum is attained if it is attained. If the minimum is attained in finitely many points, the method finds them all. The method is based on the Stetter–Möller matrix method from the theory of construct...
متن کاملCertiied Computer Algebra
Computer algebra is about constructions and problems in algebra which can be ee-ciently computed or decided by mechanical procedures. A challenging point of importing computer algebra to type theory is that it require the formalisation of a considerable amount of non-trivial mathematics. The correctness of simple computer algebra algorithms can often depend on quite deep mathematical results, a...
متن کاملOpen Problems in the Theory of Constructive Algebraic Systems
In this paper we concentrate on open problems in two directions in the development of the theory of constructive algebraic systems. The first direction deals with universal algebras whose positive open diagrams can be computably enumerated. These algebras are called positive algebras. Here we emphasize the interplay between universal algebra and computability theory. We propose a systematic stu...
متن کامل